Robust four-manifolds and robust embeddings
نویسندگان
چکیده
منابع مشابه
Robust 4−manifolds and Robust Embeddings
A link in the 3−sphere is homotopically trivial, according to Milnor, if its components bound disjoint maps of disks in the 4−ball. This paper concerns the question of what spaces give rise to the same class of homotopically trivial links when used in place of disks in the analogous definition. We show that there are 4−manifolds for which this property depends on their embedding in the 4−ball. ...
متن کاملRobust Gram Embeddings
Word embedding models learn vectorial word representations that can be used in a variety of NLP applications. When training data is scarce, these models risk losing their generalization abilities due to the complexity of the models and the overfitting to finite data. We propose a regularized embedding formulation, called Robust Gram (RG), which penalizes overfitting by suppressing the disparity...
متن کاملRobust Multiple Manifolds Structure Learning
We present a robust multiple manifolds structure learning (RMMSL) scheme to robustly estimate data structures under the multiple low intrinsic dimensional manifolds assumption. In the local learning stage, RMMSL efficiently estimates local tangent space by weighted low-rank matrix factorization. In the global learning stage, we propose a robust manifold clustering method based on local structur...
متن کاملEnvironmental Noise Embeddings for Robust Speech Recognition
We propose a novel deep neural network architecture for speech recognition that explicitly employs knowledge of the background environmental noise within a deep neural network acoustic model. A deep neural network is used to predict the acoustic environment in which the system in being used. The discriminative embedding generated at the bottleneck layer of this network is then concatenated with...
متن کاملWordRank: Learning Word Embeddings via Robust Ranking
Embedding words in a vector space has gained a lot of attention in recent years. While state-of-the-art methods provide efficient computation of word similarities via a low-dimensional matrix embedding, their motivation is often left unclear. In this paper, we argue that word embedding can be naturally viewed as a ranking problem due to the ranking nature of the evaluation metrics. Then, based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2010
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.2010.248.191